General error estimate for adiabatic quantum computing
نویسندگان
چکیده
منابع مشابه
Error Correcting Codes For Adiabatic Quantum Computation
Recently, there has been growing interest in using adiabatic quantum computation as an architecture for experimentally realizable quantum computers. One of the reasons for this is the idea that the energy gap should provide some inherent resistance to noise. It is now known that universal quantum computation can be achieved adiabatically using 2-local Hamiltonians. The energy gap in these Hamil...
متن کاملAdiabatic Quantum Computing: An Overview
Quantum computations can be implemented not only by the action of quantum circuits, but by the adiabatic evolution of a system’s Hamiltonian. This can be done by initializing the system into the ground state of a simple Hamiltonian, and then adiabatically evolving the Hamiltonian to one whose ground state encodes the solution to the problem. The time complexity of the problem, or more basically...
متن کاملGeneral conditions for a quantum adiabatic evolution
The smallness of the variation rate of the hamiltonian matrix elements compared to the (square of the) energy spectrum gap is usually believed to be the key parameter for a quantum adiabatic evolution. However it is only perturbatively valid for scaled timed hamiltonian and resonance processes as well as off resonance possible constructive Stückelberg interference effects violate this usual con...
متن کاملThreshold Estimate for Fault Tolerant Quantum Computing
I make a rough estimate of the accuracy threshold for fault tolerant quantum computing with concatenated codes. First I consider only gate errors and use the depolarizing channel error model. I will follow P.Shor [1] for fault tolerant error correction (FTEC) and the fault tolerant implementation of elementary operations on states encoded by the 7-qubit code. A simple computer simulation sugges...
متن کاملGraph isomorphism and adiabatic quantum computing
In the Graph Isomorphism (GI) problem two N -vertex graphs G and G′ are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G → G′. If yes, then G and G′ are said to be isomorphic; otherwise they are non-isomorphic. The GI problem is an important problem in computer science and is thought to be of comparable difficul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2006
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.73.062307